Exact methods for the resource levelling problem
نویسندگان
چکیده
Project management in the present time is characterized by rapid advancements in many technologies, hardly calculable risks and very tight deadlines for nearly all kinds of projects. Planning and steering of projects under these conditions turns out to be a really tough job even for the most experienced project managers. To deal responsibly with project sponsors or customers, they must consider carefully the resources that are required to complete a project on time and within the estimated budget. As a consequence, the levelling of resources has faded into the focus of attention. Especially within the mid-term planning a deliberate resource allocation plan is important to avoid bottlenecks in the subsequent short-term resource planning or even during the execution of some project. Resources in this context could for example be employees, machinery or even scarce work spaces (like test stands in automotive development projects). An interesting application for resource levelling has been proposed in [3]. In maketo-order production all products are manufactured on the basis of a given set of customer orders with individual delivery dates. The production quantities of the final products are therefore externally given due to these orders. A so called Master Production Schedule (MPS) specifies the exact amounts of all main products and the corresponding times of production. The MPS is thereby usually determined in the mid-term planning and serves as input for the subsequent short-term planning. It has already been discussed in the literature that levelling resource requirements in the mid-term planning of projects is crucial to achieve good feasible solutions at subsequent planning steps because remarkable fluctuations in the utilization of resources like manpower or machinery often cause extra labor or financial expenditure (cf. [5]). In make-to-order production products are only produced on demand and hence the workload distribution over time cannot be balanced via inventory holding. Instead,
منابع مشابه
An Exact Algorithm for the Mode Identity Project Scheduling Problem
In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملA mathematical model for the multi-mode resource investment problem
This paper presents an exact model for the resource investment problem with generalized precedence relations in which the minimum or maximum time lags between a pair of activities may vary depending on the chosen modes. All resources considered are renewable. The objective is to determine a mode and a start time for each activity so that all constraints are obeyed and the resource investment co...
متن کاملOptimisation of Construction Resource Allocation and Levelling Using Genetic Algorithm
Resource allocation and levelling is one of the top challenges in construction project management, due to complex nature of the construction projects.CPM and PERT is most commonly used methods for scheduling of construction projects. However it is not capable of minimising undesirable fluctuations in resource utilisation profile. This research describes a Genetic algorithm approach to resource ...
متن کاملA Genetic Algorithm and a Model for the Resource Constrained Project Scheduling Problem with Multiple Crushable Modes
Abstract: This paper presents an exact model and a genetic algorithm for the multi-mode resource constrained project scheduling problem with generalized precedence relations in which the duration of an activity is determined by the mode selection and the duration reduction (crashing) applied within the selected mode. All resources considered are renewable. The objective is to determine a mode, ...
متن کاملA Bi-level Formulation for Centralized Resource Allocation DEA Models
In this paper, the common centralized DEA models are extended to the bi-level centralized resource allocation (CRA) models based on revenue efficiency. Based on the Karush–Kuhn–Tucker (KKT) conditions, the bi-level CRA model is reduced to a one-level mathematical program subject to complementarity constraints (MPCC). A recurrent neural network is developed for solving this one-level mathematica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Scheduling
دوره 14 شماره
صفحات -
تاریخ انتشار 2011